Read Something Once, Why Read it Again?: Repetitive Reading and Recall
نویسندگان
چکیده
منابع مشابه
Introducing Read-Polarity-Once Functions
Efficient exact factoring algorithms exist in the literature, but they are limited to read-once (RO) functions where each variable appears once in the final equation. These algorithms have two limitations: (1) they do not consider incompletely specified functions; and (2) they are not applicable to binate functions. To overcome the first limitation, we propose an algorithm that finds RO formula...
متن کاملDequantizing Read-once Quantum Formulas
Quantum formulas, defined by Yao [FOCS ’93], are the quantum analogs of classical formulas, i.e., classical circuits in which all gates have fanout one. We show that any read-once quantum formula over a gate set that contains all single-qubit gates is equivalent to a read-once classical formula of the same size and depth over an analogous classical gate set. For example, any readonce quantum fo...
متن کاملTesting Monotone Read-Once Functions
A checking test for a monotone read-once function f depending essentially on all its n variables is a set of vectors M distinguishing f from all other monotone read-once functions of the same variables. We describe an inductive procedure for obtaining individual lower and upper bounds on the minimal number of vectors T (f) in a checking test for any function f . The task of deriving the exact v...
متن کاملAmplification by Read-Once Formulas
Moore and Shannon have shown that relays with arbitrarily high reliability can be built from relays with arbitrarily poor reliability. Valiant used similar methods to construct monotone read-once formulas of size O(n) (where α = log√ 5−1 2 ≃ 3.27) that amplify (ψ− 1 n , ψ+ 1 n ) (where ψ = ( √ 5− 1)/2 ≃ 0.62) to (2−n, 1− 2−n) and deduced as a consequence the existence of monotone formulas of th...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Reading Behavior
سال: 1989
ISSN: 0022-4111
DOI: 10.1080/10862968909547684